On the Identification of Vertices Using Cycles
نویسنده
چکیده
A set of cycles C1, . . . , Ck in a graph G is said to identify the vertices v if the sets {j : v ∈ Cj} are all nonempty and di erent. In this paper, bounds for the minimum possible k are given when G is the graph Zp endowed with the Lee or Hamming metric or G is a complete bipartite graph.
منابع مشابه
The Validation of the Thermal Regions in Iran with an Emphasis on the Identification of the Climatic Cycles
Background: The present study aimed to validate the thermal regions in Iran with an emphasis on the identification of the climatic cycles during the recent half-century. Methods: Data on daily temperature were extracted for 383 synoptic stations of Iran Meteorological Organization. For the zoning of the temperatures of Iran, multivariate statistical techniques (cluster analysis and discriminan...
متن کاملOn the tenacity of cycle permutation graph
A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.
متن کاملOn generalized atom-bond connectivity index of cacti
The generalized atom-bond connectivity index of a graph G is denoted by ABCa(G) and defined as the sum of weights ((d(u)+d(v)-2)/d(u)d(v))aa$ over all edges uv∊G. A cactus is a graph in which any two cycles have at most one common vertex. In this paper, we compute sharp bounds for ABCa index for cacti of order $n$ ...
متن کاملOn the reliability wiener number
One of the generalizations of the Wiener number to weighted graphs is to assign probabilities to edges, meaning that in nonstatic conditions the edge is present only with some probability. The Reliability Wiener number is defined as the sum of reliabilities among pairs of vertices, where the reliability of a pair is the reliability of the most reliable path. Closed expressions are derived for t...
متن کاملCharacterization of signed paths and cycles admitting minus dominating function
If G = (V, E, σ) is a finite signed graph, a function f : V → {−1, 0, 1} is a minusdominating function (MDF) of G if f(u) +summation over all vertices v∈N(u) of σ(uv)f(v) ≥ 1 for all u ∈ V . In this paper we characterize signed paths and cycles admitting an MDF.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 10 شماره
صفحات -
تاریخ انتشار 2003